Symmetric Schemes for Computing the Minimum Eigenvalue of a Symmetric Toeplitz Matrix
نویسنده
چکیده
In 8] and 9] W. Mackens and the present author presented two generalizations of a method of Cybenko and Van Loan 4] for computing the smallest eigenvalue of a symmetric, positive deenite Toeplitz matrix. Taking advantage of the symmetry or skew symmetry of the corresponding eigenvector both methods are improved considerably.
منابع مشابه
Preconditioned Lanczos Methods for the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
In this paper, we apply the preconditioned Lanczos (PL) method to compute the minimum eigenvalue of a symmetric positive definite Toeplitz matrix. The sine transform-based preconditioner is used to speed up the convergence rate of the PL method. The resulting method involves only Toeplitz and sine transform matrix-vector multiplications and hence can be computed efficiently by fast transform al...
متن کاملA Projection Method for Computing the Minimum Eigenvalue of a Symmetric Positive De nite Toeplitz Matrix
A projection method for computing the minimal eigenvalue of a symmetric and positive deenite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in 12]. Global and cubic convergence is proved. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour.
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملThe Minimum Eigenvalue of a Symmetric Positive De nite Toeplitz Matrix and Rational Hermitian Interpolation
A novel method for computing the minimal eigenvalue of a symmetric positive deenite Toeplitz matrix is presented. Similarly to the algorithm of Cybenko and Van Loan it is a combination of bisection and a root nding method. Both phases of the method are accelerated considerably by rational Hermite interpolation of the secular equation. For randomly generated test problems of dimension 800 the av...
متن کاملA hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix
In this paper we suggest a hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix which takes advantage of two types of methods, Newton’s method for the characteristic polynomial and projection methods based on rational interpolation of the secular equation.
متن کامل